Tootfinder

I've published a detailed article about #ChatGPT hallucination minimization using predefined #SPARQL-based query templates scoped to Linked Open Data (LOD) Cloud Knowledge Graphs such as #UniProtKB…

Reducing Hallucinations in ChatGPT using Predefined Query Templates scoped to Knowledge Graphs
In the fast-paced world of artificial intelligence, chatbots using language model strategies are becoming more common. However, these chatbots sometimes generate responses based on incorrect or fabricated information, a problem often referred to as “hallucinations.

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 348 nodes and 33250 edges.
Tags: Informational, Web gr…

r-charts.com provides example code for a variety of chart types, both in base R and ggplot: #rstats #ggplot

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 349 nodes and 1393 edges.
Tags: Informational, Web gra…

@… is (hopefully) going to get LVGL support, which when running on a "Cheap Yellow Display" makes for a great little @… status/control panel.
Also powering the entire street from the house solar surplus right n…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 8361 nodes and 15751 edges.
Tags: Social, Collaboration…

Do you want to reduce your home's energy consumption, switch to greener heating, or simply know what's going on in your house? You need data and graphs! Join @… at this year's Berlin Buzzwords to learn how cheap hardware and devops observability tools can help you do just that! #bbuzz

The 1st Workshop on Knowledge Graphs and Large Language Models (KaLLM), to be held on August 15, 2024, co-located with ACL 2024, Bangkok, Thailand.
Call for Participation
Submission Deadline: May 20, 2024 at 23:59, UTC -12h, AoE
website: https://kallmworkshop.github.io/kallm2

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 4449 nodes and 9071 edges.
Tags: Technological, Communication, Unweighted, Temporal

Allow me to re-stack two of the AP’s graphs. #Uvalde
“… an investigator hired by Uvalde officials found that the city’s officers did not deserve punishment, and in some cases, praised their actions …”
“… prompting shouts of “cowards” from the audience and causing several family members of the victims to angrily walk out of the meeting.”

Uvalde parents lash out after new report clears city police of missteps during Texas school attack
An investigation Uvalde city leaders ordered into the Robb Elementary School shooting has put no blame on local police officers and defended their actions, but still acknowledged a series of failures during the response. The 2022 classroom attack left 19 children and two teachers dead. The probe by Austin-based investigator and former detective Jesse Prado for the Uvalde City Council is just one of several into the massacre. State lawmakers found in 2022 that nearly 400 local, state and federal…

Grabbed a VeryWell issue on #autism at WinCo, and can confirm the relief of a diagnosis however late in life (at 62 in my case). I was a Stoic by default...!
#ActuallyAutistic

This https://arxiv.org/abs/2312.12186 has been replaced.
link: https://scholar.google.com/scholar?q=a

Social Learning in Community Structured Graphs
Traditional social learning frameworks consider environments with a homogeneous state, where each agent receives observations conditioned on that true state of nature. In this work, we relax this assumption and study the distributed hypothesis testing problem in a heterogeneous environment, where each agent can receive observations conditioned on their own personalized state of nature (or truth). We particularly focus on community structured networks, where each community admits their own true …

This https://arxiv.org/abs/2303.07023 has been replaced.
initial toot: https://mastoxiv.page/@arX…

Testing structural balance theories in heterogeneous signed networks
The abundance of data about social relationships allows the human behavior to be analyzed as any other natural phenomenon. Here we focus on balance theory, stating that social actors tend to avoid establishing cycles with an odd number of negative links. This statement, however, can be supported only after a comparison with a benchmark. Since the existing ones disregard actors' heterogeneity, we extend Exponential Random Graphs to signed networks with both global and local constraints and emplo…

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 21157 nodes and 85468 edges.
Tags: Technological, Communication, Unweighted, Temporal

BiasKG: Adversarial Knowledge Graphs to Induce Bias in Large Language Models
Chu Fei Luo, Ahmad Ghawanmeh, Xiaodan Zhu, Faiza Khan Khattak
https://arxiv.org/abs/2405.04756

BiasKG: Adversarial Knowledge Graphs to Induce Bias in Large Language Models
Modern large language models (LLMs) have a significant amount of world knowledge, which enables strong performance in commonsense reasoning and knowledge-intensive tasks when harnessed properly. The language model can also learn social biases, which has a significant potential for societal harm. There have been many mitigation strategies proposed for LLM safety, but it is unclear how effective they are for eliminating social biases. In this work, we propose a new methodology for attacking langu…

«I miss that internet. The one that existed before terms of service. The one that existed before social graphs. The one where being a User meant having a degree of respect, not being treated like a retention/churn statistic.»
Love @…’s “I miss the internet”-zine!
https://joanwestenberg.com/books/p/c5xh9ob4qg0j8e6k05fjj6ptn7nydu

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 348 nodes and 33250 edges.
Tags: Informational, Web gr…

Artificial Intelligence Index Report 2024 , worth browsing with nice graphs and overviews,
#AI

Pew just released some statistics about what it is like to be a teacher in America right now. (Hint: it's not great.)
I've pulled a few of their graphs that validated my experiences.
https://www.pewresearch.org/social-trends/

Using fonts in R graphics can be tricky at times. {showtext} aims to make it easier: #rstats

Earlier in the week I did some plotting of Irish data on births by parity and year of age:
https://mastodon.social/@bthalpin/111921233809135227
However, for each parity the denominator for the rate should not be the whole population of women at that age, but …

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 31163 nodes and 120029 edges.
Tags: Social, Collaborati…

Great insights here into #EV charger efficiency at different power levels. Shows it's better to 'shift' than 'dim' in 'grid-conscious' or #SmartCharging programmes.
Journal publication:

I have decided, as a #selfhost with just two other people on my instance, that I'm going to limit threads.net following the example of @… quoted below. I didn't know that you can “unlimit” specific accounts! This is an interesting option.
For other a…

BiasKG: Adversarial Knowledge Graphs to Induce Bias in Large Language Models
Chu Fei Luo, Ahmad Ghawanmeh, Xiaodan Zhu, Faiza Khan Khattak
https://arxiv.org/abs/2405.04756

BiasKG: Adversarial Knowledge Graphs to Induce Bias in Large Language Models
Modern large language models (LLMs) have a significant amount of world knowledge, which enables strong performance in commonsense reasoning and knowledge-intensive tasks when harnessed properly. The language model can also learn social biases, which has a significant potential for societal harm. There have been many mitigation strategies proposed for LLM safety, but it is unclear how effective they are for eliminating social biases. In this work, we propose a new methodology for attacking langu…

Some #fediverse server stats about viral videos.
I've posted a 20MB video yesterday (And would still love to find the original source. I can't find it anywhere).
That post now has over 200 reposts.
And just that 20MB video file almost generated 100GB of outbound traffic in a day.

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 20906 nodes and 85988 edges.
Tags: Technological, Communication, Unweighted, Temporal

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 3623 nodes and 7147 edges.
Tags: Technological, Communication, Unweighted, Temporal

You are attending #DHd2024 and interested in Art History, particularly in Renaissance and Vasari's Life of the Artists? With my colleague @… we are creating a #knowledgegraph

I am trying very hard to only stay within the Unreal graph editor for all code logic (for portability reasons). But oh wow it ends up creating some pretty large graphs. And, yes, I'm constantly creating a common function library but then it means keeping a lot of tabs open.
#Unreal #ClicksNotCode

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 16726 nodes and 47594 edges.
Tags: Social, Collaboratio…

This https://arxiv.org/abs/2403.00331 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDC_…

WindGP: Efficient Graph Partitioning on Heterogenous Machines
Graph Partitioning is widely used in many real-world applications such as fraud detection and social network analysis, in order to enable the distributed graph computing on large graphs. However, existing works fail to balance the computation cost and communication cost on machines with different power (including computing capability, network bandwidth and memory size), as they only consider replication factor and neglect the difference of machines in realistic data centers. In this paper, we p…

Electric vehicles are an important provider of flexibility at local level in the UK:
“EV Chargers Take On Natural Gas for Power System Flexibility
Electric vehicles will increasingly displace fossil fuels from the grid.”
https://www.

EV Chargers Take On Natural Gas for Power System Flexibility
Electric vehicles will increasingly displace fossil fuels from the grid.

You are attending #DHd2024 and interested in Art History, particularly in Renaissance and Vasari's Life of the Artists? With my colleague @… we are creating a #knowledgegraph

This https://arxiv.org/abs/2309.00513 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSI_…

A normative approach to radicalization in social networks
In recent decades, the massification of online social connections has made information globally accessible in a matter of seconds. Unfortunately, this has been accompanied by a dramatic surge in extreme opinions, without a clear solution in sight. Using a model performing probabilistic inference in large-scale loopy graphs through exchange of messages between nodes, we show how circularity in the social graph directly leads to radicalization and the polarization of opinions. We demonstrate that…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 31163 nodes and 120029 edges.
Tags: Social, Collaborati…

More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives
Siavash Askari, Manouchehr Zaker
https://arxiv.org/abs/2402.19257 …

More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives
Many phenomena in real world social networks are interpreted as spread of influence between activated and non-activated network elements. These phenomena are formulated by combinatorial graphs, where vertices represent the elements and edges represent social ties between elements. A main problem is to study important subsets of elements (target sets or dynamic monopolies) such that their activation spreads to the entire network. In edge-weighted networks the influence between two adjacent verti…

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 47 nodes and 268 edges.
Tags: Social, Fictional, Weighted

This https://arxiv.org/abs/2403.14915 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Network Learning with Directional Sign Patterns
Complex systems can be effectively modeled via graphs that encode networked interactions, where relations between entities or nodes are often quantified by signed edge weights, e.g., promotion/inhibition in gene regulatory networks, or encoding political of friendship differences in social networks. However, it is often the case that only an aggregate consequence of such edge weights that characterize relations may be directly observable, as in protein expression of in gene regulatory networks.…

Keeping Up With the Winner! Targeted Advertisement to Communities in Social Networks
Shailaja Mallick, Vishwaraj Doshi, Do Young Eun
https://arxiv.org/abs/2403.19903

Keeping Up With the Winner! Targeted Advertisement to Communities in Social Networks
When a new product enters a market already dominated by an existing product, will it survive along with this dominant product? Most of the existing works have shown the coexistence of two competing products spreading/being adopted on overlaid graphs with same set of users. However, when it comes to the survival of a weaker product on the same graph, it has been established that the stronger one dominates the market and wipes out the other. This paper makes a step towards narrowing this gap so t…

Graph Machine Learning in the Era of Large Language Models (LLMs)
Wenqi Fan, Shijie Wang, Jiani Huang, Zhikai Chen, Yu Song, Wenzhuo Tang, Haitao Mao, Hui Liu, Xiaorui Liu, Dawei Yin, Qing Li
https://arxiv.org/abs/2404.14928

Graph Machine Learning in the Era of Large Language Models (LLMs)
Graphs play an important role in representing complex relationships in various domains like social networks, knowledge graphs, and molecular discovery. With the advent of deep learning, Graph Neural Networks (GNNs) have emerged as a cornerstone in Graph Machine Learning (Graph ML), facilitating the representation and processing of graph structures. Recently, LLMs have demonstrated unprecedented capabilities in language tasks and are widely adopted in a variety of applications such as computer v…

Structural Balance in Real-World Social Networks: Incorporating Direction and Transitivity in Measuring Partial Balance
Rezvaneh Rezapour, Ly Dinh, Lan Jiang, Jana Diesner
https://arxiv.org/abs/2405.02798

Structural Balance in Real-World Social Networks: Incorporating Direction and Transitivity in Measuring Partial Balance
Structural balance theory predicts that triads in networks gravitate towards stable configurations. The theory has been verified for undirected graphs. Since real-world networks are often directed, we introduce a novel method for considering both transitivity and sign consistency for evaluating partial balance in signed digraphs. We test our approach on graphs constructed by using different methods for identifying edge signs: natural language processing to infer signs from underlying text data,…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 348 nodes and 33250 edges.
Tags: Informational, Web gr…

This https://arxiv.org/abs/2401.14606 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIR_…

Challenging Low Homophily in Social Recommendation
Social relations are leveraged to tackle the sparsity issue of user-item interaction data in recommendation under the assumption of social homophily. However, social recommendation paradigms predominantly focus on homophily based on user preferences. While social information can enhance recommendations, its alignment with user preferences is not guaranteed, thereby posing the risk of introducing informational redundancy. We empirically discover that social graphs in real recommendation data exh…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 300 nodes and 1155 edges.
Tags: Informational, Web gra…

This https://arxiv.org/abs/2404.15664 has been replaced.
link: https://scholar.google.com/scholar?q=a

Exact Cluster Dynamics of Indirect Reciprocity in Complete Graphs
Heider's balance theory emphasizes cognitive consistency in assessing others, as is expressed by ``The enemy of my enemy is my friend.'' At the same time, the theory of indirect reciprocity provides us with a dynamical framework to study how to assess others based on their actions as well as how to act toward them based on the assessments. Well-known are the `leading eight' from L1 to L8, the eight norms for assessment and action to foster cooperation in social dilemmas while resisting the inva…

Signed graphs in data sciences via communicability geometry
Fernando Diaz-Diaz, Ernesto Estrada
https://arxiv.org/abs/2403.07493 https://

Signed graphs in data sciences via communicability geometry
Signed graphs are an emergent way of representing data in a variety of contexts were conflicting interactions exist. These include data from biological, ecological, and social systems. Here we propose the concept of communicability geometry for signed graphs, proving that metrics in this space, such as the communicability distance and angles, are Euclidean and spherical. We then apply these metrics to solve several problems in data analysis of signed graphs in a unified way. They include the pa…

GraphMatch: Subgraph Query Processing on FPGAs
Jonas Dann, Tobias G\"otz, Daniel Ritter, Jana Giceva, Holger Fr\"oning
https://arxiv.org/abs/2402.17559

GraphMatch: Subgraph Query Processing on FPGAs
Efficiently finding subgraph embeddings in large graphs is crucial for many application areas like biology and social network analysis. Set intersections are the predominant and most challenging aspect of current join-based subgraph query processing systems for CPUs. Previous work has shown the viability of utilizing FPGAs for acceleration of graph and join processing. In this work, we propose GraphMatch, the first genearl-purpose stand-alone subgraph query processing accelerator based on wor…

Transactions on Graph Data & Knowledge (TGDK) is indexed now in the
Directory of Open Access Journals (DOAJ)
#knowledgegraphs

Transactions on Graph Data and Knowledge – DOAJ
A peer-reviewed, open access journal in graph algorithms, graph databases, graph representation learning, knowledge graphs, knowledge representation & linked data.

WindGP: Efficient Graph Partitioning on Heterogenous Machines
Li Zeng, Haohan Huang, Binfan Zheng, Kang Yang, Shengcheng Shao, Jinhua Zhou, Jun Xie, Rongqian Zhao, Xin Chen
https://arxiv.org/abs/2403.00331

WindGP: Efficient Graph Partitioning on Heterogenous Machines
Graph Partitioning is widely used in many real-world applications such as fraud detection and social network analysis, in order to enable the distributed graph computing on large graphs. However, existing works fail to balance the computation cost and communication cost on machines with different power (including computing capability, network bandwidth and memory size), as they only consider replication factor and neglect the difference of machines in realistic data centers. In this paper, we p…

Semantic Data for Humanities and Social Sciences (SDHSS): an Ecosystem of CIDOC CRM Extensions for Research Data Production and Reuse
Francesco BerettaLARHRA, LARHRA PHN
https://arxiv.org/abs/2402.07531

Semantic Data for Humanities and Social Sciences (SDHSS): an Ecosystem of CIDOC CRM Extensions for Research Data Production and Reuse
Given the challenge of giant knowledge graphs created by major eco-nomic actors, which could virtually replace research in the Humani-ties and Social Sciences (HSS) in responding to public concerns, thequestion arises of how to increase the value of research data throughtheir publication and networking, applying the FAIR principles. Bothan epistemological and a semantic analysis show that the most rel-evant part of research data is factual information, understood as arepresentation of the objec…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 334 nodes and 32988 edges.
Tags: Informational, Web gr…

This https://arxiv.org/abs/2305.16882 has been replaced.
link: https://scholar.google.com/scholar?q=a

Link Residual Closeness of Harary Graphs
The study of networks characteristics is an important subject in different fields, like math, chemistry, transportation, social network analysis etc. The residual closeness is one of the most sensitive measure of graphs vulnerability. In this article we calculate the link residual closeness of Harary graphs.

This https://arxiv.org/abs/2306.15747 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Blind Graph Matching Using Graph Signals
Classical graph matching aims to find a node correspondence between two unlabeled graphs of known topologies. This problem has a wide range of applications, from matching identities in social networks to identifying similar biological network functions across species. However, when the underlying graphs are unknown, the use of conventional graph matching methods requires inferring the graph topologies first, a process that is highly sensitive to observation errors. In this paper, we tackle the …

This https://arxiv.org/abs/2402.18470 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSI_…

A Higher-Order Lens for Social Systems
Despite the widespread adoption of higher-order mathematical structures such as hypergraphs, methodological tools for their analysis lag behind those for traditional graphs. This work addresses a critical gap in this context by proposing two micro-canonical random null models for directed hypergraphs: the Directed Hypergraph Configuration Model (DHCM) and the Directed Hypergraph JOINT Model (DHJM). These models preserve essential structural properties of directed hypergraphs such as node in- an…

Buffered Streaming Edge Partitioning
Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz, Daniel Seemaier
https://arxiv.org/abs/2402.11980 https://

Buffered Streaming Edge Partitioning
Addressing the challenges of processing massive graphs, which are prevalent in diverse fields such as social, biological, and technical networks, we introduce HeiStreamE and FreightE, two innovative (buffered) streaming algorithms designed for efficient edge partitioning of large-scale graphs. HeiStreamE utilizes an adapted Split-and-Connect graph model and a Fennel-based multilevel partitioning scheme, while FreightE partitions a hypergraph representation of the input graph. Besides ensuring s…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 40421 nodes and 175692 edges.
Tags: Social, Collaborati…

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 24649 nodes and 100924 edges.
Tags: Technological, Communication, Unweighted, Temporal

This https://arxiv.org/abs/2402.12426 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSI_…

Attacks on Node Attributes in Graph Neural Networks
Graphs are commonly used to model complex networks prevalent in modern social media and literacy applications. Our research investigates the vulnerability of these graphs through the application of feature based adversarial attacks, focusing on both decision time attacks and poisoning attacks. In contrast to state of the art models like Net Attack and Meta Attack, which target node attributes and graph structure, our study specifically targets node attributes. For our analysis, we utilized the …

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 349 nodes and 1393 edges.
Tags: Informational, Web gra…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 16706 nodes and 121251 edges.
Tags: Social, Collaborati…

Solving the Graph Burning Problem for Large Graphs
Felipe de Carvalho Pereira, Pedro Jussieu de Rezende, Tallys Yunes, Luiz Fernando Batista Morato
https://arxiv.org/abs/2404.17080

Solving the Graph Burning Problem for Large Graphs
We propose an exact algorithm for the Graph Burning Problem ($\texttt{GBP}$), an NP-hard optimization problem that models the spread of influence on social networks. Given a graph $G$ with vertex set $V$, the objective is to find a sequence of $k$ vertices in $V$, namely, $v_1, v_2, \dots, v_k$, such that $k$ is minimum and $\bigcup_{i = 1}^{k} \{u\! \in\! V\! : d(u, v_i) \leq k - i\} = V$, where $d(u,v)$ denotes the distance between $u$ and $v$. We formulate the problem as a set covering integ…

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 41 nodes and 126 edges.
Tags: Social, Fictional, Weighted

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 433 nodes and 1941 edges.
Tags: Informational, Web gra…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 300 nodes and 1155 edges.
Tags: Informational, Web gra…

Cramer's moderate deviations of modularity in network
Yu Miao, Qing Yin
https://arxiv.org/abs/2404.10802 https://arxiv.org/pdf/24…

Cramer's moderate deviations of modularity in network
Complex networks play a crucial role in understanding physical, biological, social and technological systems. One of the most relevant features of graphs representing real systems is community structure. In this paper, for a specific partition of a given network, we prove the Cramer's moderate deviations of modularity for the partition when the size of the network gets large.

Network Learning with Directional Sign Patterns
Anqi Dong, Can Chen, Tryphon T. Georgiou
https://arxiv.org/abs/2403.14915 https://arx…

Network Learning with Directional Sign Patterns
Complex systems can be effectively modeled via graphs that encode networked interactions, where relations between entities or nodes are often quantified by signed edge weights, e.g., promotion/inhibition in gene regulatory networks, or encoding political of friendship differences in social networks. However, it is often the case that only an aggregate consequence of such edge weights that characterize relations may be directly observable, as in protein expression of in gene regulatory networks.…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 348 nodes and 33250 edges.
Tags: Informational, Web gr…

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 24056 nodes and 98782 edges.
Tags: Technological, Communication, Unweighted, Temporal

Efficient k-step Weighted Reachability Query Processing Algorithms
Lian Chen, Junfeng Zhou, Ming Du, Sheng Yu, Xian Tang, Ziyang Chen
https://arxiv.org/abs/2403.13181

Efficient k-step Weighted Reachability Query Processing Algorithms
Given a data graph G, a source vertex u and a target vertex v of a reachability query, the reachability query is used to answer whether there exists a path from u to v in G. Reachability query processing is one of the fundamental operations in graph data management, which is widely used in biological networks, communication networks, and social networks to assist data analysis. The data graphs in practical applications usually contain information such as quantization weights associated with the…

Signed Graph Representation Learning: A Survey
Zeyu Zhang, Peiyao Zhao, Xin Li, Jiamou Liu, Xinrui Zhang, Junjie Huang, Xiaofeng Zhu
https://arxiv.org/abs/2402.15980

Signed Graph Representation Learning: A Survey
With the prevalence of social media, the connectedness between people has been greatly enhanced. Real-world relations between users on social media are often not limited to expressing positive ties such as friendship, trust, and agreement, but they also reflect negative ties such as enmity, mistrust, and disagreement, which can be well modelled by signed graphs. Signed Graph Representation Learning (SGRL) is an effective approach to analyze the complex patterns in real-world signed graphs with …

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 4205 nodes and 8275 edges.
Tags: Technological, Communication, Unweighted, Temporal

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 334 nodes and 32988 edges.
Tags: Informational, Web gr…

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 17509 nodes and 71658 edges.
Tags: Technological, Communication, Unweighted, Temporal

A Higher-Order Lens for Social Systems
Giulia Preti, Adriano Fazzone, Giovanni Petri, Gianmarco De Francisci Morales
https://arxiv.org/abs/2402.18470 https…

A Higher-Order Lens for Social Systems
Despite the widespread adoption of higher-order mathematical structures such as hypergraphs, methodological tools for their analysis lag behind those for traditional graphs. This work addresses a critical gap in this context by proposing two micro-canonical random null models for directed hypergraphs: the Directed Hypergraph Configuration Model (DHCM) and the Directed Hypergraph JOINT Model (DHJM). These models preserve essential structural properties of directed hypergraphs such as node in- an…

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 22332 nodes and 90784 edges.
Tags: Technological, Communication, Unweighted, Temporal

This https://arxiv.org/abs/2102.00665 has been replaced.
link: https://scholar.google.com/scholar?q=a

Attributed Graph Alignment
Motivated by various data science applications including de-anonymizing user identities in social networks, we consider the graph alignment problem, where the goal is to identify the vertex/user correspondence between two correlated graphs. Existing work mostly recovers the correspondence by exploiting the user-user connections. However, in many real-world applications, additional information about the users, such as user profiles, might be publicly available. In this paper, we introduce the at…

Towards Linear Spanners in All Temporal Cliques
Sebastian Angrick, Ben Bals, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin Wells
https://arxiv.org/abs/2402.13624

Towards Linear Spanners in All Temporal Cliques
Many real-world networks, like transportation networks and social networks, are dynamic in the sense that the edge set may change over time, but these changes are known in advance. This behavior is captured by the temporal graphs model, which has recently become a trending topic in theoretical computer science. A core open problem in the field is to prove the existence of linear-size temporal spanners in temporal cliques, i.e., sparse subgraphs of complete temporal graphs that ensure all-pairs …

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 38 nodes and 103 edges.
Tags: Social, Fictional, Weighted

This https://arxiv.org/abs/2301.10550 has been replaced.
initial toot: https://mastoxiv.page/@arX…

Structural insulators and promotors in networks under generic problem-solving dynamics
The collective coordination of distributed tasks in a complex system can be represented as decision dynamics on a graph. This abstract representation allows studying the performance of local decision heuristics as a function of task complexity and network architecture. Here we identify hard-to-solve and easy-to-solve networks in a social differentiation task within the basic model of small-world graphs. We show that, depending on the details of the decision heuristic as well as the length of th…

This https://arxiv.org/abs/2201.10106 has been replaced.
link: https://scholar.google.com/scholar?q=a

On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment
Graph alignment aims at finding the vertex correspondence between two correlated graphs, a task that frequently occurs in graph mining applications such as social network analysis. Attributed graph alignment is a variant of graph alignment, in which publicly available side information or attributes are exploited to assist graph alignment. Existing studies on attributed graph alignment focus on either theoretical performance without computational constraints or empirical performance of efficient…

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 4572 nodes and 9414 edges.
Tags: Technological, Communication, Unweighted, Temporal

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 25826 nodes and 104802 edges.
Tags: Technological, Communication, Unweighted, Temporal

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 5819 nodes and 12443 edges.
Tags: Technological, Communication, Unweighted, Temporal

The process of polarisation as a loss of dimensionality: measuring changes in polarisation using Singular Value Decomposition of network graphs
Sage Anastasi, Giulio Dalla Riva
https://arxiv.org/abs/2403.18191

The process of polarisation as a loss of dimensionality: measuring changes in polarisation using Singular Value Decomposition of network graphs
The increasing polarisation in our societies is a major international concern. Current approaches to defining and detecting polarisation largely rely on finding evidence of bimodality in social networks or voter opinion surveys. It is difficult to detect temporal trends in polarisation, as the results usually fall into a binary of polarised or non-polarised, which cannot robustly show that subsequent increases in bimodality are statistically significant. Our work is aligned with Baldassari an…

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 25526 nodes and 104824 edges.
Tags: Technological, Communication, Unweighted, Temporal

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 6289 nodes and 13420 edges.
Tags: Technological, Communication, Unweighted, Temporal

This https://arxiv.org/abs/2402.18470 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSI_…

A Higher-Order Lens for Social Systems
Despite the widespread adoption of higher-order mathematical structures such as hypergraphs, methodological tools for their analysis lag behind those for traditional graphs. This work addresses a critical gap in this context by proposing two micro-canonical random null models for directed hypergraphs: the Directed Hypergraph Configuration Model (DHCM) and the Directed Hypergraph JOINT Model (DHJM). These models preserve essential structural properties of directed hypergraphs such as node in- an…

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 3430 nodes and 6514 edges.
Tags: Technological, Communication, Unweighted, Temporal

This https://arxiv.org/abs/2401.14009 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSI_…

On the Feasibility of Simple Transformer for Dynamic Graph Modeling
Dynamic graph modeling is crucial for understanding complex structures in web graphs, spanning applications in social networks, recommender systems, and more. Most existing methods primarily emphasize structural dependencies and their temporal changes. However, these approaches often overlook detailed temporal aspects or struggle with long-term dependencies. Furthermore, many solutions overly complicate the process by emphasizing intricate module designs to capture dynamic evolutions. In this w…

Attacks on Node Attributes in Graph Neural Networks
Ying Xu, Michael Lanier, Anindya Sarkar, Yevgeniy Vorobeychik
https://arxiv.org/abs/2402.12426 https://…

Attacks on Node Attributes in Graph Neural Networks
Graphs are commonly used to model complex networks prevalent in modern social media and literacy applications. Our research investigates the vulnerability of these graphs through the application of feature based adversarial attacks, focusing on both decision-time attacks and poisoning attacks. In contrast to state-of-the-art models like Net Attack and Meta Attack, which target node attributes and graph structure, our study specifically targets node attributes. For our analysis, we utilized the …

This https://arxiv.org/abs/2402.03522 has been replaced.
link: https://scholar.google.com/scholar?q=a

Influencer Identification on Link Predicted Graphs
How would admissions look like in a it university program for influencers? In the realm of social network analysis, influence maximization and link prediction stand out as pivotal challenges. Influence maximization focuses on identifying a set of key nodes to maximize information dissemination, while link prediction aims to foresee potential connections within the network. These strategies, primarily deep learning link prediction methods and greedy algorithms, have been previously used in tande…